Performance Optimized Expectation Conditional Maximization Algorithms for Nonhomogeneous Poisson Process Software Reliability Models

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bayesian Approach Using Nonhomogeneous Poisson Process for Software Reliability Models

Bayesian approach using nonhomogeneous Poisson process is considered for modeling software reliability problems. A generalized gamma and lognormal order statistics models are considered to model epochs of the failures of software. Metropolis algorithms along with Gibbs steps are proposed to perform the Bayesian inference of such models. Some Bayesian model diagnostics are developed and incorpor...

متن کامل

The dynamic ‘expectation–conditional maximization either’ algorithm

The ‘expectation–conditional maximization either’ (ECME) algorithm has proven to be an effective way of accelerating the expectation–maximization algorithm for many problems. Recognizing the limitation of using prefixed acceleration subspaces in the ECME algorithm, we propose a dynamic ECME (DECME) algorithm which allows the acceleration subspaces to be chosen dynamically. The simplest DECME im...

متن کامل

Rigid Point Registration with Expectation Conditional Maximization

This paper addresses the issue of matching rigid 3D object points with 2D image points through point registration based on maximum likelihood principle in computer simulated images. Perspective projection is necessary when transforming 3D coordinate into 2D. The problem then recasts into a missing data framework where unknown correspondences are handled via mixture models. Adopting the Expectat...

متن کامل

Clustering performance comparison using K-means and expectation maximization algorithms

Clustering is an important means of data mining based on separating data categories by similar features. Unlike the classification algorithm, clustering belongs to the unsupervised type of algorithms. Two representatives of the clustering algorithms are the K-means and the expectation maximization (EM) algorithm. Linear regression analysis was extended to the category-type dependent variable, w...

متن کامل

Sufficient statistics and expectation maximization algorithms in phylogenetic tree models

MOTIVATION Measuring evolutionary conservation is a routine step in the identification of functional elements in genome sequences. Although a number of studies have proposed methods that use the continuous time Markov models (CTMMs) to find evolutionarily constrained elements, their probabilistic structures have been less frequently investigated. RESULTS In this article, we investigate a suff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Reliability

سال: 2017

ISSN: 0018-9529,1558-1721

DOI: 10.1109/tr.2017.2716419